The Sieve Re-Imagined: Integer Factorization Methods
نویسنده
چکیده
In this paper, I explain the Quadratic Sieve, its Multiple Polynomial variation, the Number Field Sieve, and give some worked examples of the afore-mentioned algorithms. Using my own Maple implementation of the Quadratic Sieve, I explore the effect of altering one of the parameters of the Quadratic Sieve algorithm, with respect to both time and success rate.
منابع مشابه
The number field sieve
We describe the main ideas underlying integer factorization using the number field sieve.
متن کاملUsing Lucas Sequences to Factor Large Integers near Group Orders
Factoring large integers into primes is one of the most important and most difficult problems of computational number theory (the twin problem is primality testing [13]). Trial division, Fermat's algorithm [1], [3], [8], Pollard's p-\ method [6], Williams' p + \ method [11], Lenstra's elliptic curve method (ECM) [5], Pomerance's quadratic sieve (QS) [7], [10], and Pollard's number field sieve (...
متن کاملA Description of the Number Field Sieve
The number field sieve is a relatively new method to factor large integers. Its most notable success is the factorization of the ninth Fermat number. It is significantly faster than all known existing integer factoring algorithms. We examine the theoretical underpinnings of the sieve; after understanding how it works, we state the algorithm. We look mostly to the algebraic number theory aspects...
متن کاملMapReduce for Integer Factorization
Integer factorization is a very hard computational problem. Currently no e cient algorithm for integer factorization is publicly known. However, this is an important problem on which it relies the security of many real world cryptographic systems. I present an implementation of a fast factorization algorithm on MapReduce. MapReduce is a programming model for high performance applications develo...
متن کاملA Kilobit Special Number Field Sieve Factorization
We describe how we reached a new factoring milestone by completing the first special number field sieve factorization of a number having more than 1024 bits, namely the Mersenne number 2 − 1. Although this factorization is orders of magnitude ‘easier’ than a factorization of a 1024-bit RSA modulus is believed to be, the methods we used to obtain our result shed new light on the feasibility of t...
متن کامل